Computing open-loop noncooperative solution in discrete dynamic games

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Results on the Existence of Open Loop Nash Equilibria in Discrete Time Dynamic Games

We address the problem of finding conditions which guarantee the existence of open-loop Nash equilibria in discrete time dynamic games (DTDGs). The classical approach to DTDGs involves analyzing the problem using optimal control theory which yields results mainly limited to linear-quadratic games [1]. We show the existence of equilibria for a class of DTDGs where the cost function of players ad...

متن کامل

Disturbed Discrete Time Linear-Quadratic Open-Loop Nash games

We examine disturbed linear-quadratic games, where each player chooses his strategy according to a modified Nash equilibrium model under open-loop information structure. We give conditions for the existence and uniqueness of such an equilibrium. We also show how these conditions are related to certain Riccati difference equations and a boundary value problem.

متن کامل

Differential games with mixed leadership: The open-loop solution

This paper introduces the notion of mixed leadership in nonzero-sum differential games, where there is no fixed hierarchy in decision making with respect to the players. Whether a particular player is leader or follower depends on the instrument variable s/he is controlling, and it is possible for a player to be both leader and follower, depending on the control variable. The paper studies two-...

متن کامل

Bottleneck Games in Noncooperative Networks

We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, each associated with a positive flow demand, and a load-dependent performance function for each network element. We first prove the existence of a Nash equilibrium, considering two routing scenarios, namely when a user can ...

متن کامل

Noncooperative Games and Applications

A basic problem in optimization theory is to find the maximum value of a function φ over a set X: max x∈X φ(x). (1) One can think of X as the set of possible choices available to an individual, while φ(x) is his corresponding payoff. Game theory, on the other hand, is concerned with the more complex situation where two or more individuals, or " players " are present [?]. Each player can choose ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Evolutionary Economics

سال: 1997

ISSN: 0936-9937,1432-1386

DOI: 10.1007/s001910050032